Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract)
نویسندگان
چکیده
In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as well as a multiplicative 4-spanner of G. In all cases the tree T can be computed in linear time. Q 1999 Academic Press
منابع مشابه
Distance Approximating Trees for Chordal and Dually Chordal Graphs
In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملDetermining possible sets of leaves for spanning trees of dually chordal graphs
It will be proved that the problem of determining whether a set of vertices of a dually chordal graphs is the set of leaves of a tree compatible with it can be solved in polynomial time by establishing a connection with finding clique trees of chordal graphs with minimum number of leaves.
متن کاملTotal-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملOn basic chordal graphs and some of its subclasses
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its clique graph. In this work, we consider some subclasses of basic chordal graphs. One of them is the class of hereditary basic chordal graphs, which will turn out to have many p...
متن کامل